Complexity of Weighted Approximation over Rd

نویسندگان

  • Grzegorz W. Wasilkowski
  • Henryk Wozniakowski
چکیده

We study approximation of univariate functions deened over the reals. We assume that the rth derivative of a function is bounded in a weighted L p norm with a weight. Approximation algorithms use the values of a function and its derivatives up to order r ? 1. The worst case error of an algorithm is deened in a weighted L q norm with a weight. We study the worst case (information) complexity of the weighted approximation problem, which is equal to the minimal number of function and derivative evaluations needed to obtain error ". We provide necessary and suucient conditions in terms of the weights and , as well as the parameters r; p and q for the weighted approximation problem to have nite complexity. We also provide conditions which guarantee that the complexity of weighted approximation is of the same order as the complexity of the classical approximation problem over a nite interval. Such necessary and suucient conditions are also provided for a weighted integration problem since its complexity is equivalent to the complexity of the weighted approximation problem for q = 1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Worst Case Complexity of Weighted Approximation and Integration over Rd

We study the worst case complexity of weighted approximation and integration for functions deened over R d. We assume that the functions have all partial derivatives of order up to r uniformly bounded in a weighted L p-norm for a given weight function. The integration and the error for approximation are deened in a weighted sense for another given weight %. We present a necessary and suucient c...

متن کامل

Complexity of Weighted Approximation over

We study approximation of univariate functions deened over the reals. We assume that the rth derivative of a function is bounded in a weighted L p norm with a weight. Approximation algorithms use the values of a function and its derivatives up to order r ? 1. The worst case error of an algorithm is deened in a weighted L q norm with a weight. We study the worst case (information) complexity of ...

متن کامل

Theoretical Study of Polyethylene Crystallization Using Modified Weighted Density Approximation (MWDA)

      In this article, the crystallization of polyethylene is investigated by the modified weighted density approximation. Also, a direct correlation function of polyethylene based on the RISM theory is used. The free energy of a polyethylene is calculated using the density functional theory. The crystallization and also the solid and liquid densities of polyethylene are calculated and compared...

متن کامل

On the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators

In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Complexity

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2001